Relaxation Methods for Linear Programs
نویسندگان
چکیده
Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/page/info/about/policies/terms.jsp. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive only for your personal, non-commercial use.
منابع مشابه
A General Framework for Convex Relaxation of Polynomial Optimization Problems over Cones
The class of POPs (Polynomial Optimization Problems) over cones covers a wide range of optimization problems such as 0-1 integer linear and quadratic programs, nonconvex quadratic programs and bilinear matrix inequalities. This paper presents a new framework for convex relaxation of POPs over cones in terms of linear optimization problems over cones. It provides a unified treatment of many exis...
متن کاملA p-cone sequential relaxation procedure for 0-1 integer programs
Given a 0-1 integer programming problem, several authors have introduced sequential relaxation techniques — based on linear and/or semidefinite programming — that generate the convex hull of integer points in at most n steps. In this paper, we introduce a sequential relaxation technique, which is based on p-order cone programming (1 ≤ p ≤ ∞). We prove that our technique generates the convex hul...
متن کاملEquivalence of Piecewise-Linear Approximation and Lagrangian Relaxation for Network Revenue Management
The network revenue management (RM) problem arises in airline, hotel, media, and other industries where the sale products use multiple resources. It can be formulated as a stochastic dynamic program, but the dynamic program is computationally intractable because of an exponentially large state space, and a number of heuristics have been proposed to approximate its value function. Notable amongs...
متن کاملAn Adaptive Partition-Based Approach for Solving Two-Stage Stochastic Programs with Fixed Recourse
We study an adaptive partition-based approach for solving two-stage stochastic programs with fixed recourse. A partition-based formulation is a relaxation of the original stochastic program, and we study a finitely converging algorithm in which the partition is adaptively adjusted until it yields an optimal solution. A solution guided refinement strategy is developed to refine the partition by ...
متن کاملB-347 Towards the Implementation of Successive Convex Relaxation Method for Noncon- vex Quadratic Optimization Problems
Recently Kojima and Tun cel proposed new successive convex relaxation methods and their localized-discretized variants for general nonconvex quadratic programs. Although an upper bound of the objective function value within a prior precision can be found theoretically by solving a nite number of linear programs, several important implementation problems remain unsolved. In this paper we discuss...
متن کاملA storm of feasibility pumps for nonconvex MINLP
One of the foremost difficulties in solving Mixed-Integer Nonlinear Programs, either with exact or heuristic methods, is to find a feasible point. We address this issue with a new feasibility pump algorithm tailored for nonconvex Mixed-Integer Nonlinear Programs. Feasibility pumps are algorithms that iterate between solving a continuous relaxation and a mixed-integer relaxation of the original ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Math. Oper. Res.
دوره 12 شماره
صفحات -
تاریخ انتشار 1987